Two computational primitives for algorithmic self-assembly: copying and counting.

نویسندگان

  • Robert D Barish
  • Paul W K Rothemund
  • Erik Winfree
چکیده

Copying and counting are useful primitive operations for computation and construction. We have made DNA crystals that copy and crystals that count as they grow. For counting, 16 oligonucleotides assemble into four DNA Wang tiles that subsequently crystallize on a polymeric nucleating scaffold strand, arranging themselves in a binary counting pattern that could serve as a template for a molecular electronic demultiplexing circuit. Although the yield of counting crystals is low, and per-tile error rates in such crystals is roughly 10%, this work demonstrates the potential of algorithmic self-assembly to create complex nanoscale patterns of technological interest. A subset of the tiles for counting form information-bearing DNA tubes that copy bit strings from layer to layer along their length.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Computational Primitives for Algorithmic Self-Assembly: Copying and Counting Supporting Information

1 Methods Estimated bound on effective error rates: Given an assembly of tiles on a scaffold of N repeat units in which each tile has a mismatch with its lower or right neighbor with independent probability = 1−p, we would like to bound the probability that the assembly contains a particular pattern of M tiles that has been observed. In particular, we are interested in the probability of seeing...

متن کامل

An information-bearing seed for nucleating algorithmic self-assembly.

Self-assembly creates natural mineral, chemical, and biological structures of great complexity. Often, the same starting materials have the potential to form an infinite variety of distinct structures; information in a seed molecule can determine which form is grown as well as where and when. These phenomena can be exploited to program the growth of complex supramolecular structures, as demonst...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

Algorithmic DNA Self-assembly

Self-assembly is a process by which simple objects autonomously assemble into complexes. This phenomenon is common in nature but is not yet well understood from mathematical and programming perspectives. It is believed that self-assembly technology will ultimately permit the precise fabrication of complex nanostructures. There are many kinds of self-assembly and DNA self-assembly is of particul...

متن کامل

Contributions to computational phylogenetics and algorithmic self-assembly

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix CHAPTER 1. General Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Computational Phylogenetics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 The Perfect Phylogeny Problem . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 The Tree Compatibility Problem . . . . . . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Nano letters

دوره 5 12  شماره 

صفحات  -

تاریخ انتشار 2005